多级可修备件库存的生灭过程建模与优化

针对VARI-METRIC模型在低可用度下结果不准确的问题,建立基于生灭过程的任意等级、任意层级可修件库存优化模型。通过对各级站点、各类备件需求率与到达率的预测,对每个部件建立其生灭过程模型,并提出基于生灭过程的装备可用度计算方法。以整个保障系统的装备可用度为约束指标,以备件总购置费最低为目标,利用边际算法得到最优备件配置方案,并建立仿真模型对所得优化方案进行评估与调整。结合算例,以仿真结果作为检验标准,选取权威的VMETRIC软件与该解析模型在优化性能、计算精度及适用性上进行对比和说明。结果表明,无论是解析模型还是VMETRIC软件,均存在一定的适用范围,而采用解析与仿真相结合的方法无疑具有更强的适应性。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Optimal (τ, T) opportunistic maintenance of a k‐out‐of‐n:G system with imperfect PM and partial failure

The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000     

用于DDR3访存优化的数据缓冲机制

为提高DDR3控制器访存效率,设计了基于DDR3存储器预取访问数据长度的数据缓冲机制,将访存请求分为三种基本类型并分别排队处理,降低数据丢弃和实际动态随机访问存储器访问发生次数。针对图像和视频类应用程序的实验结果表明,相对于传统先到先服务的DDR3访存控制器,该机制取得了平均21.3%、最好51.3%的性能提升,硬件开销在可接受范围内。     

飞机飞行控制律多目标优化设计研究

针对传统飞行控制律参数单目标优化设计不能同时满足多控制指标要求,且与飞行品质要求缺乏相关性,物理意义不明确等缺点,提出了一种基于改进NSGA-II算法的飞行控制律多目标优化设计方法。在该算法中提出了一种分化进化策略,使得进化搜索过程中染色体群可以自适应分化为数量和构成动态调整的子群,避免了多染色体子群对局部最优区域的重复搜索,维持染色体的多样性,有效抑制了早熟收敛现象发生。最后,使用改进的NSGA-II算法对某型飞机横航向控制律设计进行数值仿真,结果显示提出算法有效提高控制律优化调参效率,结果满足期望的飞行品质要求。     

关于m×n型流程优化的探讨

网络图的优化，是根据一定的约束条件对网络图进行调整和改进，以达到科学安排工作，合理分配人力、物力、财力等资源，从而提高工作效率的目的。流程优化就是通过改变工作顺序，解决组织计划中出现的窝工现象。m×n型流程优化，是解决有m个单位依次进行n项活动时，如何安排各单位的顺序最优的问题。通过案例的耗时分析，提出了确定单位顺序的方法，希望对解决相似问题提供一定的参考。     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

序列近似优化方法及其在火箭外形快速设计中的应用

针对序列近似优化方法在代理模型构造与采样策略等方面的不足,基于采样点局部密度,引入与局部密度成反比的样本点影响体积概念,通过优化总影响体积确定径向基函数最优核宽度,满足序列近似优化过程不同规模、非均匀样本条件下的函数近似需要;建立潜在可行域最大距离加点准则,并与潜在最优加点准则结合平衡算法的探索能力与开发能力;建立三步收敛判定准则;构建改进序列近似优化的算法流程。对于Golinski减速器的优化设计问题,算法在目标函数调用42次后便搜索到全局最优解,体现了其良好的全局寻优能力与搜索效率。以"天航二号"火箭为例,建立其外形优化问题数学模型,所提优化方法在调用原始计算模型165次之后便搜索到全局最优解,大大提高了设计效率,同时飞行试验也表明设计结果满足要求。     

火箭-双燃烧室冲压组合循环发动机概念研究

临近空间高超声速飞行器近年来获得了广泛关注,本文提出一种以基于火箭发动机和双燃烧室冲压发动机的多模态火箭-双燃烧室冲压组合循环发动机作为飞行器的动力系统,并进行了性能分析研究。该飞行器在海拔10 km左右高度以0.8马赫的速度投放,在重力和发动机推力的联合作用下,能够在海拔5～8 km处加速到2马赫;然后加速爬升进入临近空间,发动机工作在引射亚燃或者双燃烧室亚燃模态下。可以根据实际选择高推重比、较低推进剂比冲效率的引射亚燃模态,或是较低推重比、高推进剂比冲效率的双燃烧室亚燃模态。最终飞行器加速到6马赫(26 km),进入双燃室超燃模态。针对空中发射模式和地面发射模式进行了轨道优化,仿真结果表明:在加速爬升到6马赫(26 km)的过程中,空中发射模式相比较地面发射模式可以节省37%的推进剂;空中发射模式存在一个负的最优初始飞行角度使得剩余质量与初始质量的比值达到最大。     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051